A tight bound on the error probability of space-time codes for rapid fading channels
نویسندگان
چکیده
This paper presents the performance of Space-Time (ST) codes over rapid fading channels. A tight upper bound on the pairwise error probability (PWEP) of ST codes over rapid fading channels is derived. Also, an upper bound on the bit error probability (BEP) is evaluated using the derived PWEP. The existing and new bounds are evaluated for different QPSK ST codes and compared to the simulation results. The new bound is shown to be tighter than the existing bound by almost 2 dBs and is very tight to the simulation results.
منابع مشابه
Upper Bound on the Error Probability for Space-Time Codes in Fast Fading Channels
−We present exact union bounds on the error probability of space-time codes in fast Rayleigh and Rician fading channels. Using Craig’s formula for the Gaussian Q-function, an exact pairwise error probability (PEP) of space-time codes is expressed in the form of a single finite-range integral whose integrand involves in the moment generating function (MGF) of a nonnegative random variable. Based...
متن کاملGeneralized Union Bound for Space-Time Codes
⎯Gallager’s second bounding technique, also known as the generalized union bound, is employed to derive a new upper bound on the error probability of space-time codes with maximum-likelihood (ML) decoding on quasi-static Rayleigh fading channels. The new bound is distinguished by two characteristics: unlike the classical union bound, the new bound is rapidly convergent and is only a few decibel...
متن کاملPairwise error probability of space-time codes for a keyhole channel
We present a closed form upper bound for the average pairwise error probabilities (PEP) of space-time codes for a keyhole channel. It is derived from the exact conditional PEP for given fading channel coefficients, using a moment generating function-based approach. We include simulation results for varying numbers of antennas which affirm that the proposed PEP serves as a tight bound for codes ...
متن کاملSpace-time code performance bounds on quasistatic fading channels
We evaluate truncated union bounds on the frame error rate performance of space-time (ST) codes operating over the quasistatic fading channel and compare them to results of computer simulation. Both ST trellis and block codes are considered. We calculate these bounds by characterizing the set of codeword differences from a general expression for the exact pairwise error probability (PEP). We de...
متن کاملPragmatic Space-Time Codes for Cooperative Relaying in Block Fading Channels
We address the problem of construction of space-time codes for cooperative communications in block fading channels. More precisely, we consider a pragmatic approach based on the concatenation of convolutional codes and BPSK/QPSK modulation to obtain cooperative codes for relay networks, for which we derive the pairwise error probability, an asymptotic bound for frame error probability, and a de...
متن کامل